In search of an easy witness: exponential time vs. probabilistic polynomial time
نویسندگان
چکیده
منابع مشابه
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
Restricting the search space f gn to the set of truth tables of easy Boolean functions on logn variables as well as using some known hardness randomness tradeo s we establish a number of results relating the complexity of exponential time and probabilistic polynomial time complexity classes In particular we show that NEXP P poly NEXP MA this can be interpreted as saying that no derandomization ...
متن کاملLinear, Polynomial or Exponential? Complexity Inference in Polynomial Time
We present a new method for inferring complexity properties for imperative programs with bounded loops. The properties handled are: polynomial (or linear) boundedness of computed values, as a function of the input; and similarly for the running time. It is well known that complexity properties are undecidable for a Turing-complete programming language. Much work in program analysis overcomes th...
متن کاملExponential Time Paradigms Through the Polynomial Time Lens
We propose a general approach to modelling algorithmic paradigms for the exact solution of NP-hard problems. Our approach is based on polynomial time reductions to succinct versions of problems solvable in polynomial time. We use this viewpoint to explore and compare the power of paradigms such as branching and dynamic programming, and to shed light on the true complexity of various problems. A...
متن کاملAn Higher-Order Characterization of Probabilistic Polynomial Time (Long Version)
We present RSLR, an implicit higher-order characterization of the class PP of those problems which can be decided in probabilistic polynomial time with error probability smaller than 1/2. Analogously, a (less implicit) characterization of the class BPP can be obtained. RSLR is an extension of Hofmann’s SLR with a probabilistic primitive, which enjoys basic properties such as subject reduction a...
متن کاملProbabilistic Polynomial-Time Equivalence and Security Analysis
We use properties of observational equivalence for a proba-bilistic process calculus to prove an authentication property of a cryptographic protocol. The process calculus is a form of-calculus, with probabilistic scheduling instead of nondeterminism, over a term language that captures probabilistic polynomial time. The operational semantics of this calculus gives priority to communication over ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2002
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(02)00024-7